A combinatorial error bound for t-point-based sampling
نویسندگان
چکیده
منابع مشابه
Assessing Error Bound For Dominant Point Detection
This paper compares the error bounds of two classes of dominant point detection methods, viz. methods based on reducing a distance metric and methods based on digital straight segments. We highlight using two methods in each class that the error bounds within the same class may vary depending upon the fine details and control parameters of the methods but the essential error bound can be determ...
متن کاملOn the error bound in a combinatorial central limit theorem
Let X = {Xij : 1 ≤ i, j ≤ n} be an n× n array of independent random variables where n ≥ 2. Let π be a uniform random permutation of {1,2, . . . , n}, independent of X, and let W =∑ni=1 Xiπ(i). Suppose X is standardized so that EW = 0,Var(W)= 1. We prove that the Kolmogorov distance between the distribution of W and the standard normal distribution is bounded by 451 ∑n i,j=1 E|Xij |3/n. Our appr...
متن کاملA Combinatorial Bound for Beacon-based Routing in Orthogonal Polygons
Beacon attraction is a movement system whereby a robot (modeled as a point in 2D) moves in a free space so as to always locally minimize its Euclidean distance to an activated beacon (also a point). This results in the robot moving directly towards the beacon when it can, and otherwise sliding along the edge of an obstacle. When a robot can reach the activated beacon by this method, we say that...
متن کاملA harmony search based pairwise sampling strategy for combinatorial testing
Over the years, we become increasingly dependent on software in many activities of our lives. To ensure software quality and reliability, many combinations of possible input parameters, hardware/software environments and system conditions need to be tested and verified against for conformance. Due to resource constraints and time-to-market pressure, considering all exhaustive testing is practic...
متن کاملSequential Computation of p-values based on (Re-)Sampling with a Guaranteed Error Bound
When explicit forms of p-values are not available or cannot be evaluated efficiently, e.g. in the case of a bootstrap test, one usually resorts to simulation. Especially when a simulation step is computationally expensive it is of interest to draw a small number of samples. This article introduces a sequential procedure to evaluate the p-value using simulation. It guarantees that, up to a small...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00280-9